Color-families are dense
نویسندگان
چکیده
منابع مشابه
Groupwise dense families
We show that the Filter Dichotomy Principle implies that there are exactly four classes of ideals in the set of increasing functions from the natural numbers. We thus answer two open questions on consequences of < . We show that < implies that = , and that Filter Dichotomy together with < implies < . The technical means is the investigation of groupwise dense sets, ideals, filters and ultrafilt...
متن کاملDense and Non-Dense Families of Complexity Classes
Let t be any abstract measure of computational complexity, and let L denote the specific measure of memory resource (tape) on one tape Turing machines. De~ote by R:() the class of all total functions whose t-complexity is bounded by the function t() almost everywhere. Call such classes t-complexity classes. We are interested in relationships among these classes, under proper set inclusion (C). ...
متن کاملChromaticity of some families of dense graphs
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of G. If [G]={G}, then G is said to be chromatically unique. In this paper, we 4rst determine [G] for each graph G whose complement 5 G is of the form aK1∪bK3∪⋃16i6s Pli , where a; b are any nonnegative integers and li is...
متن کاملNew dense families of triple loop networks
Multi-loop digraphs are widely studied mainly because of their symmetric properties and their applications to loop networks. A multi-loop digraph G=G(N;s~,...,SA) has set of vertices V-ZN and adjacencies given by v ~ v + si modN, i = 1 ..... A. For every fixed N, an usual extremal problem is to find the minimum value D(N) = min D(N; where D(N;s~ ..... s~) is the diameter of G. A closely related...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90129-3